Sets,
Relations, Closure and Languages, Finite Automata, deterministic and
nondeterministic, Closure and pumping lemma, Regular languages and expressions,
Context-Free Grammar, Regular languages and Context-Free languages, pushdown
automata, closure, determinism and parsing, LL (1) Grammar, Turing
machines and machine schemas, examples, Introduction to P
and NP classes.